Memory management for dataflow programming of multirate signal processing algorithms

Memory management for dataflow programming of multirate signal processing algorithms

Memory Management for Dataflow Programming of Multirate Signal Processing Algorithms1

Managing the buffering of data along arcs is a critical part of compiling a synchronous dataflow (SDF) program. This paper shows how dataflow properties can be analyzed at compile-time to make buffering more efficient. Since the target code corresponding to each node of an SDF graph is normally obtained from a hand-optimized library of predefined blocks, the efficiency of data transfer between ...

Looped Schedules for Dataflow Descriptions of Multirate Signal Processing Algorithms

References 28 of 29 max_connected(G) The set of maximal connected subgraphs of the SDF graph G. The number of invocations of the source actor of SDF arc α that precede the ith invocation of sink(α) in schedule S. p(α) The number of samples produced onto SDF arc α by one invocation of source(α). periodic schedule A schedule that invokes each actor at least once and produces no net change in the ...

Looped Schedules for Dataflow Descriptions of Multirate Signal Processing Algorithms1

The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments for multirate signal processing applications. In this paradigm, the repetition of computations is specified by the relative rates at which the computations consume and produce data. This implicit specification of iteration allows a compiler to easily explore alternative nested loop structures fo...

Generating Compact Code from Dataflow Specifications of Multirate Signal Processing Algorithms

Synchronous dataflow (SDF) semantics are well-suited to representing and compiling multirate signal processing algorithms. A key to this match is the ability to cleanly express iteration without overspecifying the execution order of computations, thereby allowing efficient schedules to be constructed. Due to limited program memory, it is often desirable to translate the iteration in an SDF grap...